package main.practices.algorithmCourse.math;

/**
 * @Description:
 *               Given an integer n, return the number of trailing zeroes
 *               in n!.
 *
 *               Example 1:
 *
 *               Input: 3
 *               Output: 0
 *               Explanation: 3! = 6, no trailing zero.
 *               Example 2:
 *
 *               Input: 5
 *               Output: 1
 *               Explanation: 5! = 120, one trailing zero.
 *               Note: Your solution should be in logarithmic time
 *               complexity.
 * @Author: shenpeng
 * @Date: 2020-03-12
 */
public class TrailingZeros {

    public int trailingZeroes(int n) {

        int count = 0;
        int cur = n;
        while (cur > 0) {
            cur = cur / 5;
            count += cur;
        }
        return count;
    }

}
